Irreducible polynomial

Results: 71



#Item
41Root separation for reducible integer polynomials Yann Bugeaud and Andrej Dujella Abstract We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

Root separation for reducible integer polynomials Yann Bugeaud and Andrej Dujella Abstract We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

Add to Reading List

Source URL: bib.irb.hr

Language: English - Date: 2013-11-21 13:19:28
42Algebraic Geometry I Fall 2013 Eduard Looijenga Rings are always supposed to possess a unit element 1 and a ring homomorphism will always take unit to unit. We allow that 1 = 0, but in that case we get of course the zer

Algebraic Geometry I Fall 2013 Eduard Looijenga Rings are always supposed to possess a unit element 1 and a ring homomorphism will always take unit to unit. We allow that 1 = 0, but in that case we get of course the zer

Add to Reading List

Source URL: www.staff.science.uu.nl

Language: English - Date: 2013-12-26 23:18:31
43Topics In Algebra Elementary Algebraic Geometry David Marker Spring[removed]Contents

Topics In Algebra Elementary Algebraic Geometry David Marker Spring[removed]Contents

Add to Reading List

Source URL: homepages.math.uic.edu

Language: English - Date: 2004-01-31 19:22:28
44Special curves and postcritically-finite polynomials Laura DeMarco University of Illinois at Chicago

Special curves and postcritically-finite polynomials Laura DeMarco University of Illinois at Chicago

Add to Reading List

Source URL: homepages.math.uic.edu

Language: English - Date: 2012-10-25 11:25:12
45Automorphisms of even unimodular lattices and unramified Salem numbers Benedict H. Gross and Curtis T. McMullen 1 January, 2002  Abstract

Automorphisms of even unimodular lattices and unramified Salem numbers Benedict H. Gross and Curtis T. McMullen 1 January, 2002 Abstract

Add to Reading List

Source URL: math.harvard.edu

Language: English - Date: 2010-04-02 19:43:40
46Sage Reference Manual: Finite Rings Release 6.3 The Sage Development Team  August 11, 2014

Sage Reference Manual: Finite Rings Release 6.3 The Sage Development Team August 11, 2014

Add to Reading List

Source URL: www.sagemath.org

Language: English - Date: 2014-11-16 14:58:21
47Classifying polynomials and identity testing MANINDRA AGRAWAL1,∗ and RAMPRASAD SAPTHARISHI2 1 2

Classifying polynomials and identity testing MANINDRA AGRAWAL1,∗ and RAMPRASAD SAPTHARISHI2 1 2

Add to Reading List

Source URL: www.ias.ac.in

Language: English - Date: 2010-02-23 06:21:54
48Course Description for Spring 2003 Course Title: Math 788G: The Theory of Irreducible Polynomials II Instructor: Michael Filaseta Prerequisites: Graduate Standing (no prior Number Theory course is necessary; background m

Course Description for Spring 2003 Course Title: Math 788G: The Theory of Irreducible Polynomials II Instructor: Michael Filaseta Prerequisites: Graduate Standing (no prior Number Theory course is necessary; background m

Add to Reading List

Source URL: www.math.sc.edu

Language: English - Date: 2002-08-28 10:37:15
49Generalizations of some irreducibility results by Schur T.N. Shorey and R. Tijdeman October 16, 2009 Section 1. Introduction Let a ≥ 0 and a0 , a1 , . . . , an be integers with

Generalizations of some irreducibility results by Schur T.N. Shorey and R. Tijdeman October 16, 2009 Section 1. Introduction Let a ≥ 0 and a0 , a1 , . . . , an be integers with

Add to Reading List

Source URL: www.math.tifr.res.in

Language: English - Date: 2009-10-22 08:03:09
50Course 311, Part IV: Galois Theory Problems Hilary Term[removed]Use Eisenstein’s criterion to verify that the following polynomials are irreducible over Q:— (i ) t2 − 2;

Course 311, Part IV: Galois Theory Problems Hilary Term[removed]Use Eisenstein’s criterion to verify that the following polynomials are irreducible over Q:— (i ) t2 − 2;

Add to Reading List

Source URL: www.maths.tcd.ie

Language: English - Date: 2006-03-16 12:03:53